Learning Picture Languages Using Dimensional Reduction

On Drawn Symbolic Picture Languages

On Reversal-Bounded Picture Languages

Kim, C. and I.H. Sudborough, On reversal-bounded picture languages, Theoretical Computer Science 104 (1992) 185-206. For an integer k >O, a k-reversal-bounded picture language is a chain-code picture language which is described by a language L over the alphabet R= {u,d,r, I} such that, for every word x in L, the number of alternating occurrences of r’s and I’s in x is bounded by k. It is shown ...

On Some Recognizable Picture-Languages

We show that the language of pictures over fa; bg, where all occurring b's are connected is recognizable, which solves an open problem in Mat98]. We generalize the used construction to show that monocausal deterministically recognizable picture languages are recognizable, which is surprisingly nontrivial. Furthermore we show that the language of pictures over fa; bg, where the number of a's is ...

Learning regular languages using RFSAs

Residual languages are important and natural components of regular languages and several grammatical inference algorithms naturally rely on this notion. In order to identify a given target language L, classical inference algorithms try to identify words which de/ne identical residual languages of L. Here, we study whether it could be interesting to perform a tighter analysis by identifying incl...

Learning Regular Languages Using RFSA